Collision avoidance maneuver optimization with a multiple-impulse convex formulation

A method to compute optimal collision avoidance maneuvers for short-term encounters is presented. The are modeled as multiple-impulses handle impulsive cases and approximate finite burn arcs associated either with short alert times or the use of low-thrust propulsion. maneuver design formulated a sequence convex optimization problems solved in polynomial time by state-of-the-art primal-dual interior-point algorithms. proposed approach calculates solutions without assumptions about thrust arc structure direction. execution fraction second an problem hundreds variables constraints, making it suitable autonomous calculations.